3,121 research outputs found

    First-order and multi-order diffractive lens using a device with 8P phase modulation range

    Get PDF
    Postprint (published version

    Horizontal Grid Size Selection and its Influence on Mesoscale Model Simulations

    Get PDF

    Resource location based on precomputed partial random walks in dynamic networks

    Full text link
    The problem of finding a resource residing in a network node (the \emph{resource location problem}) is a challenge in complex networks due to aspects as network size, unknown network topology, and network dynamics. The problem is especially difficult if no requirements on the resource placement strategy or the network structure are to be imposed, assuming of course that keeping centralized resource information is not feasible or appropriate. Under these conditions, random algorithms are useful to search the network. A possible strategy for static networks, proposed in previous work, uses short random walks precomputed at each network node as partial walks to construct longer random walks with associated resource information. In this work, we adapt the previous mechanisms to dynamic networks, where resource instances may appear in, and disappear from, network nodes, and the nodes themselves may leave and join the network, resembling realistic scenarios. We analyze the resulting resource location mechanisms, providing expressions that accurately predict average search lengths, which are validated using simulation experiments. Reduction of average search lengths compared to simple random walk searches are found to be very large, even in the face of high network volatility. We also study the cost of the mechanisms, focusing on the overhead implied by the periodic recomputation of partial walks to refresh the information on resources, concluding that the proposed mechanisms behave efficiently and robustly in dynamic networks.Comment: 39 pages, 25 figure

    Image encryption system based on a nonlinear joint transform correlator for the simultaneous authentication of two users

    Get PDF
    We propose a new encryption system based on a nonlinear joint transform correlator (JTC) using the information of two biometrics (one digital fingerprint for each user) as security keys of the encryption system. In order to perform the decryption and authentication in a proper way, it is necessary to have the two digital fingerprints from the respective users whose simultaneous authentication is pursued. The proposed security system is developed in the Fourier domain. The nonlinearity of the JTC along with the five security keys given by the three random phase masks and the two digital fingerprints of the two users allow an increase of the system security against brute force and plaintext attacks. The feasibility and validity of this proposal is demonstrated using digital fingerprints as biometrics in numerical experiments.Peer ReviewedPostprint (published version

    Complex-linear invariants of biochemical networks

    Full text link
    The nonlinearities found in molecular networks usually prevent mathematical analysis of network behaviour, which has largely been studied by numerical simulation. This can lead to difficult problems of parameter determination. However, molecular networks give rise, through mass-action kinetics, to polynomial dynamical systems, whose steady states are zeros of a set of polynomial equations. These equations may be analysed by algebraic methods, in which parameters are treated as symbolic expressions whose numerical values do not have to be known in advance. For instance, an "invariant" of a network is a polynomial expression on selected state variables that vanishes in any steady state. Invariants have been found that encode key network properties and that discriminate between different network structures. Although invariants may be calculated by computational algebraic methods, such as Gr\"obner bases, these become computationally infeasible for biologically realistic networks. Here, we exploit Chemical Reaction Network Theory (CRNT) to develop an efficient procedure for calculating invariants that are linear combinations of "complexes", or the monomials coming from mass action. We show how this procedure can be used in proving earlier results of Horn and Jackson and of Shinar and Feinberg for networks of deficiency at most one. We then apply our method to enzyme bifunctionality, including the bacterial EnvZ/OmpR osmolarity regulator and the mammalian 6-phosphofructo-2-kinase/fructose-2,6-bisphosphatase glycolytic regulator, whose networks have deficiencies up to four. We show that bifunctionality leads to different forms of concentration control that are robust to changes in initial conditions or total amounts. Finally, we outline a systematic procedure for using complex-linear invariants to analyse molecular networks of any deficiency.Comment: 36 pages, 6 figure

    Industrias óseas musterienses en el cantábrico oriental: Los "alisadores" en hueso de los niveles B, C Y D de Axlor (Dima, Bizkaia)

    Get PDF
    Se presentan cuatro fragmentos de hueso, de los niveles de Paleolítico Medio de la cueva de Axlor, con huellas de uso en tareas repetitivas. Esos trabajos provocaron la abrasión y pulido de las zonas activas, lo que ha permitido su identificación como utillaje. Los objetos se han denominado "alisadores", a modo de hipótesis funcional. La naturaleza precisa de las labores realizadas no puede concretarse, en este estadio de la investigación, haciéndose necesaria la elaboración de un programa experimental específico. Para situar los materiales en su contexto, se ofrece en primer lugar una breve síntesis de los trabajos realizados en el yacimiento Musteriense de Axlor
    corecore